Perspective reformulations of mixed integer nonlinear programs with indicator variables

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Perspective reformulations of mixed integer nonlinear programs with indicator variables

We study mixed integer nonlinear programs (MINLP)s that are driven by a collection of indicator variables where each indicator variable controls a subset of the decision variables. An indicator variable, when it is “turned off”, forces some of the decision variables to assume fixed values, and, when it is “turned on”, forces them to belong to a convex set. Many practical MINLPs contain integer ...

متن کامل

Reformulations and Decompositions of Mixed Integer Linear and Nonlinear Programs

Université Paris-Dauphine LAMSADE Habilitation à diriger des Recherches Reformulations and Decompositions of Mixed Integer Linear and Nonlinear Programs

متن کامل

Double-Perspective Functions for Mixed-Integer Fractional Programs with Indicator Variables

Perspective functions have long been used to convert fractional programs into convex programs. More recently, they have been used to form tight relaxations of mixed-integer nonlinear programs with socalled indicator variables. Motivated by a practical application (maximising energy efficiency in an OFDMA system), we consider problems that have a fractional objective and indicator variables simu...

متن کامل

Global Optimization of Mixed-Integer Nonlinear Programs

A variety of applications in economics, finance, engineering design, the chemical and biological sciences, and a host of other areas give rise to nonconvex nonlinear and mixed-integer nonlinear programs (NLPs and MINLPs). BARON was originally developed in the early 1990s as a computational system to facilitate experimentation with novel deterministic algorithms for global optimization. Since th...

متن کامل

Linear Reformulations of Integer Quadratic Programs

Let (QP ) be an integer quadratic program that consists in minimizing a quadratic function subject to linear constraints. In this paper, we present several linearizations of (QP ). Many linearization methods for the quadratic 0-1 programs are known. A natural approach when considering (QP ) is to reformulate it into a quadratic 0-1 program. However, this method, that we denote BBL (Binary Binar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Programming

سال: 2010

ISSN: 0025-5610,1436-4646

DOI: 10.1007/s10107-010-0360-z